Modeling Gravitational Clustering without Computing Gravitational Force

نویسنده

  • Sergei F. Shandarin
چکیده

The large-scale structure in the Universe is believed to arise out of small random density perturbations generated in the very early Universe, that are amplified by gravity. Large and usually intricate N-body simulations are typically employed to model the complex nonlinear dynamics in a self gravitating medium. We suggest a very simple model which predicts, on large scales, the correct density and velocity distributions. The model does not involve an explicit computation of the gravitational force. It is based on a simple transformation of the variables and local conservation laws of mass and generalized linear momentum. The model demonstrates that the overall appearance of large-scale structure in the Universe is explicitly determined by the initial velocity field and it reveals the most significant large-scale effects of gravity on the formation of structure. Subject headings: cosmology: theory – large-scale structure of universe

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Gravitational Based Hierarchical Clustering Algorithm

We propose a new gravitational based hierarchical clustering algorithm using kdtree. kdtree generates densely populated packets and finds the clusters using gravitational force between the packets. Gravitational based hierarchical clustering results are of high quality and robustness. Our method is effective as well as robust. Our proposed algorithm is tested on synthetic dataset and results ar...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Random gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem

this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...

متن کامل

Color image segmentation by gravitational clustering in color space using neighbor-relationship

In this paper, we propose a color image segmentation method based on gravitational clustering using neighbor relations in the spatial domain and distance information in RGB space among pixels. Most clustering-based segmentation algorithms use only color space distances after pixels are mapped from the spatial domain to color space, ignoring their neighbor relations; but we use both information....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996